Making Bound Consistency as Effective as Arc Consistency
نویسندگان
چکیده
We study under what conditions bound consistency (BC) and arc consistency (AC), two forms of propagation used in constraint solvers, are equivalent to each other. We show that they prune exactly the same values when the propagated constraint is connected row convex / closed under median and its complement is row convex. This characterization is exact for binary constraints. Since row convexity depends on the order of the values in the domains, we give polynomial algorithms for computing orders under which BC and AC are equivalent, if any.
منابع مشابه
Bound arc consistency for weighted CSPs
WCSP is a soft constraint framework with a wide range of applications. Most current complete solvers can be described as a depthfirst branch and bound search that maintain some form of local consistency during the search. However, the known consistencies are unable to solve problems with huge domains because of their time and space complexities. In this paper, we adapt a weaker form of arc cons...
متن کاملExistential arc consistency: Getting closer to full arc consistency in weighted CSPs
The weighted CSP framework is a soft constraint framework with a wide range of applications. Most current state-of-the-art complete solvers can be described as a basic depth-first branch and bound search that maintain some form of arc consistency during the search. In this paper we introduce a new stronger form of arc consistency, that we call existential directional arc consistency and we prov...
متن کاملDirected Arc Consistency Preprocessing as a Strategy for Maximal Constraint Satisfaction
1 ABSTRACT A constraint satisfaction problem (CSP) may be overcon-strained and not admit a complete solution. Optimal solutions to such partial constraint satisfaction problems (PCSPs), in which a maximum number of constraints are satissed, can be found using branch and bound variants of CSP algorithms. Earlier work has shown how information gained through local consistency checking during prep...
متن کاملBounds Arc Consistency for Weighted CSPs
The Weighted Constraint Satisfaction Problem (WCSP) framework allows representing and solving problems involving both hard constraints and cost functions. It has been applied to various problems, including resource allocation, bioinformatics, scheduling, etc. To solve such problems, solvers usually rely on branch-and-bound algorithms equipped with local consistency filtering, mostly soft arc co...
متن کاملVirtual Arc Consistency for Weighted CSP
Optimizing a combination of local cost functions on discrete variables is a central problem in many formalisms such as in probabilistic networks, maximum satisfiability, weighted CSP or factor graphs. Recent results have shown that maintaining a form of local consistency in a Branch and Bound search provides bounds that are strong enough to solve many practical instances. In this paper, we intr...
متن کامل